Easy distributions for combinatorial optimization problems with probabilistic constraints
نویسندگان
چکیده
منابع مشابه
Easy distributions for combinatorial optimization problems with probabilistic constraints
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N (μi, λμi), for some λ > 0 and μi > 0, or Γ(ki, θ) for some θ > 0 and ki > 0. The constraint can also be linearized when the coefficients are independent and identically distributed if they are, besides, either positive or strictly stable random variables.
متن کاملStochastic Combinatorial Optimization under Probabilistic Constraints
In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center problem and the set cover problem, with uncertainty characterized by a probability distribution over set of points or elements to be covered. We consider these ...
متن کاملIt looks easy! Heuristics for combinatorial optimization problems.
Human performance on instances of computationally intractable optimization problems, such as the travelling salesperson problem (TSP), can be excellent. We have proposed a boundary-following heuristic to account for this finding. We report three experiments with TSPs where the capacity to employ this heuristic was varied. In Experiment 1, participants free to use the heuristic produced solution...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2010
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.09.005